On Squares, Cubes,... in Z[[x]]∗

نویسندگان

  • Nadia Heninger
  • E. M. Rains
چکیده

Motivated by the discovery that the eighth root of the theta series of the E 8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f ∈ Z[[x]]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data

In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively without crack patching. Our approach is based on the marching cubes algorithm, a popular method to convert volumetric data to polygonal meshes. The original marching cubes algorithm suffers from problems of topological inco...

متن کامل

On the Maximal Number of Cubic Subwords in a String

We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum number of squares in a word is not well understood. Several new results related to this problem are produced in the paper. We consider two simple problems related to the maximum number of subwords which are squares or...

متن کامل

A Coherent Homotopy Category of 2-track Commutative Cubes

We consider a category H ⊗ (the homotopy category of homotopy squares) whose objects are homotopy commutative squares of spaces and whose morphisms are cubical diagrams subject to a coherent homotopy relation. The main result characterises the isomorphisms of H ⊗ to be the cube morphisms whose forward arrows are homotopy equivalences. As a first application of the new category we give a direct ...

متن کامل

Level Set Extraction from Gridded 2D and 3D Data

A standard isosurface extraction algorithm for a 3D image is the Marching Cubes algorithm [4]. The image is assumed to be defined on a regular lattice of size N0×N1×N2 with integer points (x, y, z) where 0 ≤ x < N0, 0 ≤ y < N1, and 0 ≤ z < N2. The image values themselves are F (x, y, z). An isosurface is of the form F (x, y, z) = c for some specified level value c where x, y, and z are treated ...

متن کامل

On the Sums of Two Cubes

We solve the equation f(x, y) + g(x, y) = x + y for homogeneous f, g ∈ C(x, y), completing an investigation begun by Viète in 1591. The usual addition law for elliptic curves and composition give rise to two binary operations on the set of solutions. We show that a particular subset of the set of solutions is ring-isomorphic to Z[e].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005